On job scheduling on a hypercube

Real-Time Job Scheduling in Hypercube Systemsy

O-Hoon Kwon*, Jong Kim*, SungJe Hong*, and Sunggu Lee** *Dept. of Computer Science and Engineering **Dept. of Electronic and Electrical Engineering Pohang University of Science and Technology San 31 Hyoja Dong, Pohang 790-784, KOREA Phone : +(82)-562-279-2257, Fax : +(82)-562-279-2299 E-mail : [email protected] Abstract As application areas that have real-time requirements become diverse and p...

Job Scheduling on Parallel Systems

Parallel systems such as supercomputers are valuable resources which are each commonly shared among a community of users. The problem of job scheduling is to determine how that sharing should be done in order to maximize the system’s utility. This problem has been extensively studied for well over a decade, yielding a great breadth of knowledge and techniques. In this work, we survey the ideas ...

Scalable Job Scheduling on a Distributed Environment

E ect of Job Size Characteristics on Job Scheduling Performance

A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system e ciently. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics a ...

On Job Fairness in Non-Preemptive Parallel Job Scheduling

Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill polic...